Step of Proof: outr_wf
12,41
postcript
pdf
Inference at
*
I
of proof for Lemma
outr
wf
:
A
,
B
:Type,
x
:(
A
+
B
). (
(
isl(
x
)))
(outr(
x
)
B
)
latex
by ((RepD)
CollapseTHENA ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
1.
A
: Type
C1:
2.
B
: Type
C1:
3.
x
:
A
+
B
C1:
4.
(
isl(
x
))
C1:
outr(
x
)
B
C
.
Definitions
t
T
,
P
Q
,
x
:
A
.
B
(
x
)
,
Lemmas
isl
wf
,
bnot
wf
,
assert
wf
origin